package DesignPatern.A12_策略模式.MSB;

public class A02_Sorter<T>
{
    public void sort(T[] arr, Comparator<T> comparator)
    {
        for (int i = 0; i < arr.length - 1; i++)
        {
            int minPos = i;
            
            for (int j = i + 1; j < arr.length; j++)
            {
                minPos = comparator.compare(arr[j], arr[minPos]) == -1 ? j : minPos;
            }
            swap(arr, i, minPos);
        }
    }
    //sort(int)
    void swap(T[] arr, int i, int j)
    {
        T temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}
